An Algorithm for Rescheduling of Trains under Planned Track Closures

This work considered a joint problem of train rescheduling and closure planning. The derivation new run schedule the determination plan not only must guarantee satisfaction all given constraints but also optimize number accepted closures, approved runs, total time shift between resultant original schedule. Presented is novel nonlinear mixed integer optimization which valid for broad class railway networks. A multi-level hierarchical heuristic algorithm introduced due to NP-hardness problem. able, on an iterative basis, jointly select closures along with Results obtained by algorithm, launched conducted experiments, confirm its ability provide acceptable feasible solutions in reasonable amount time.